A Plausibility Argument for #P6=P from Physics
نویسندگان
چکیده
Quantum computers have been shown to be capable to deal with problems like the factoring of numbers into primes in polynomial time, i.e. they might differ from classical Turing machines with respect to computational complexity, provided #P6=P. We reverse this conclusion by giving a plausibility argument for #P6=P by arguing that as a consequence of the basic rules of quantum mechanics classical Turing machines should not be able to emulate quantum computers even if a polynomial time delay for the classical Turing machine is allowed. A generalization of the argument holds also for the case of
منابع مشابه
A Robust and Extensible Exemplar-Based Model of Thematic Fit
This paper presents a new, exemplar-based model of thematic fit. In contrast to previous models, it does not approximate thematic fit as argument plausibility or ‘fit with verb selectional preferences’, but directly as semantic role plausibility for a verb-argument pair, through similaritybased generalization from previously seen verb-argument pairs. This makes the model very robust for data sp...
متن کاملA Probabilistic Model of Semantic Plausibility in Sentence Processing
Experimental research shows that human sentence processing uses information from different levels of linguistic analysis, for example, lexical and syntactic preferences as well as semantic plausibility. Existing computational models of human sentence processing, however, have focused primarily on lexico-syntactic factors. Those models that do account for semantic plausibility effects lack a gen...
متن کاملModelling Semantic Role Plausibility in Human Sentence Processing
We present the psycholinguistically motivated task of predicting human plausibility judgements for verb-role-argument triples and introduce a probabilistic model that solves it. We also evaluate our model on the related role-labelling task, and compare it with a standard role labeller. For both tasks, our model benefits from classbased smoothing, which allows it to make correct argument-specifi...
متن کاملThe Integration of Syntax and Semantic Plausibility in a Wide-Coverage Model of Human Sentence Processing
Models of human sentence processing have paid much attention to three key characteristics of the sentence processor: Its robust and accurate processing of unseen input (wide coverage), its immediate, incremental interpretation of partial input and its sensitivity to structural frequencies in previous language experience. In this thesis, we propose a model of human sentence processing that accou...
متن کاملModeling the Ellsberg Paradox by Argument Strength
We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion probability is low or when it is highly imprecise. We show how the proposed measure provides a new model of the Ellsberg paradox. Moreover, we further substanti...
متن کامل